On complexity of special maximum matchings constructing
نویسندگان
چکیده
For bipartite graphs the NP-completeness is proved for the problem of existence of maximum matching which removal leads to a graph with given lower(upper) bound for the cardinality of its maximum matching.
منابع مشابه
Trees in Graphs with Conflict Edges or Forbidden Transitions
In a recent paper [Paths, trees and matchings under disjunctive constraints, Darmann et. al., Discr. Appl. Math., 2011] the authors add to a graph G a set of conflicts, i.e. pairs of edges of G that cannot be both in a subgraph of G. They proved hardness results on the problem of constructing minimum spanning trees and maximum matchings containing no conflicts. A forbidden transition is a parti...
متن کاملMaximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model
We study the problem of finding an approximate maximum matching in two closely related computational models, namely, the dynamic graph streaming model and the simultaneous multi-party communication model. In the dynamic graph streaming model, the input graph is revealed as a stream of edge insertions and deletions, and the goal is to design a small space algorithm to approximate the maximum mat...
متن کاملLectures 4 and 5 – Matchings
A matching in a graph is a set of edges, no two of which share an endpoint. We describe Edmond’s algorithm for finding matchings of maximum cardinality in a graph. For bipartite graphs with edge weights, we also show how to find matchings of maximum weight. It is recommended that the reader draws pictures of the various constructs that we use (such as alternating trees). I was too lazy to incor...
متن کاملTwo-sided popular matchings in bipartite graphs with forbidden/forced elements and weights
Two-sided popular matchings in bipartite graphs are a well-known generalization of stable matchings in the marriage setting, and they are especially relevant when preference lists are incomplete. In this case, the cardinality of a stable matching can be as small as half the size of a maximum matching. Popular matchings allow for assignments of larger size while still guaranteeing a certain fair...
متن کاملAlgorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs
For a bipartite graph G = (V, E), (1) perfect, (2) maximum and (3) maximal matchings are matchings (1) such that all vertices are incident to some matching edges, (2) whose cardinalities are maximum among all matchings, (3) which are contained in no other matching. In this paper, we present three algorithms for enumerating these three types of matchings. Their time complexities are O(|V |) per ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008